The Standard Additive Coalescent

نویسندگان

  • David Aldous
  • Jim Pitman
چکیده

as a fragmentation of unit mass into clusters of masses xi. The additive coalescent of Evans and Pitman is the -valued Markov process in which pairs of clusters of masses xi xj merge into a cluster of mass xi + xj at rate xi + xj. They showed that a version X∞ t −∞ < t < ∞ of this process arises as a n → ∞ weak limit of the process started at time − 2 log n with n clusters of mass 1/n. We show this standard additive coalescent may be constructed from the continuum random tree of Aldous by Poisson splitting along the skeleton of the tree. We describe the distribution of X∞ t on at a fixed time t. We show that the size of the cluster containing a given atom, as a process in t, has a simple representation in terms of the stable subordinator of index 1/2. As t → −∞, we establish a Gaussian limit for (centered and normalized) cluster sizes and study the size of the largest cluster.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a ternary coalescent process

We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescent in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain und...

متن کامل

Gravitational clustering and additive coalescence

we investigate a gravitational system in dimension one, started from some ”uniform” random initial data. In Section 2, a connection is established with the additive coalescence. An hydrodynamic limit is obtained in Section 3 and it suggests a new construction of the standard additive coalescent. The latter is given in Section 3.2. An infinite system is considered in Section 4, and is shown to b...

متن کامل

A new encoding of coalescent processes. Applications to the additive and multiplicative cases

We revisit the discrete additive and multiplicative coalescents, starting with n particles with unit mass. These cases are known to be related to some “combinatorial coalescent processes”: a time reversal of a fragmentation of Cayley trees or a parking scheme in the additive case, and the random graph process (G(n, p))p in the multiplicative case. Time being fixed, encoding these combinatorial ...

متن کامل

Coalescent Random Forests

Various enumerations of labeled trees and forests, including Cayley's formula n for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (Rn , Rn&1 , ..., R1) such that Rk has uniform distribution over the set of all forests of k rooted trees labeled by [n]. Let Rn be the trivial...

متن کامل

Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

Abstract. Regard an element of the set of ranked discrete distributions := {(x1, x2, . . .) : x1 ≥ x2 ≥ . . . ≥ 0, ∑ i xi = 1} as a fragmentation of unit mass into clusters of masses xi . The additive coalescent is the -valued Markov process in which pairs of clusters of masses {xi, xj }merge into a cluster of mass xi+xj at rate xi+xj . Aldous and Pitman (1998) showed that a version of this pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997